---
categories: Algorithm techniques
---

## Problems
- [D-query](http://www.spoj.com/problems/DQUERY/)
- [Powerful Array](http://codeforces.com/contest/86/problem/D)
- [Curious Cupid](https://open.kattis.com/problems/cupid)
- [Jeff and Removing Periods](http://codeforces.com/problemset/problem/351/D)
- [Tree and Queries](http://codeforces.com/problemset/problem/375/D)
- [Sherlock and Inversions](https://www.codechef.com/problems/IITI15)
- [Zero Query](http://www.spoj.com/problems/ZQUERY/)


## Techniques
It's possible to adapt Mo's algorithm to data structures that only support insertion, but not deletion. [^1]

### Problems
- [Chef and Graph Queries](https://www.codechef.com/MARCH14/problems/GERALD07)

## See also
- [Mo's algorithm on trees](Mo's algorithm on trees)
- [Sqrt-decomposition]()

## External links
- [MO’s Algorithm (Query square root decomposition)](https://blog.anudeep2011.com/mos-algorithm/)
- [Mo's algorithm](http://codeforces.com/blog/entry/7383)
- [Mo's algorithm](https://www.hackerearth.com/practice/notes/mos-algorithm/)

[^1]: <http://codeforces.com/blog/entry/7383#comment-161520>